P versus NP problem - PDFSEARCH.IO - Document Search Engine

P versus NP problem
Results: 202

#	Item
11	What makes the Arc-Preserving Subsequence problem hard?⋆ Guillaume Blin1 , Guillaume Fertin1 , Romeo Rizzi2 , and St´ephane Vialette3 1 2 Add to Reading List Source URL: pagesperso.lina.univ-nantes.fr Language: English - Date: 2009-07-03 08:56:55 Complexity classes NP-hardness NP P versus NP problem Computational complexity theory P Reduction
12	NP-complete Problems and Physical Reality arXiv:quant-ph/0502072v2 21 Feb 2005 Scott Aaronson∗ Add to Reading List Source URL: cqi.inf.usi.ch Language: English - Date: 2012-02-22 09:04:08 Computational complexity theory Complexity classes Quantum computing Theoretical computer science Mathematical optimization Quantum algorithm NP P versus NP problem BQP PP Low Time complexity
13	Introduction & Motivation Relations and Operations The complexity of positive equality-free first-order logic II: the four-element case Add to Reading List Source URL: www.bedewell.com Language: English - Date: 2010-08-24 16:58:08 Complexity classes Finite model theory Computational complexity theory Descriptive complexity Structural complexity theory FO SO P versus NP problem NP P Reduction HO
14	Petr Mitrichev Contest 6 http://acm.sgu.ru/, Sunday, December 27, 2009 Problem A. Black-white balls Input file: Output file: Add to Reading List Source URL: acm.sgu.ru Language: English - Date: 2009-12-27 02:37:57 NP-complete problems Clique problem Standard streams Clique P versus NP problem
15	Overview This newest release of VerbNet contains several significant changes: The addition of over 300 new verb lemmas, including some highly frequent verbs, such as own and seem. The addition of over 300 new senses of Add to Reading List Source URL: verbs.colorado.edu Language: English - Date: 2009-08-21 15:02:48 Knowledge representation Corpora Complexity classes Syntax VerbNet Semiotics FrameNet Theta role Frame language P versus NP problem NP
16	Lecture Notes for Ph219/CS219: Quantum Information Chapter 5 John Preskill California Institute of Technology Updated July 2015 Add to Reading List Source URL: www.theory.caltech.edu Language: English - Date: 2015-07-24 12:47:46 Complexity classes Computational complexity theory P versus NP problem NP P Circuit complexity Quantum circuit Boolean circuit Quantum computing Quantum gate NC Certificate
17	Abstracts Abstracts are listed in the order of presentation. Monday, 18 April Bin Packing: From Theory to Experiment and Back Again David S. Johnson Add to Reading List Source URL: events.cs.bham.ac.uk Language: English - Date: 2011-04-13 17:03:53 Logic in computer science Formal methods Philosophical logic Metalogic Formal verification Theoretical computer science First-order logic Modal logic Logic Mathematical logic P versus NP problem Automated theorem proving
18	Olympiads in Informatics, 2015, Vol. 9, 147–161 DOI: http://dx.doi.orgioiMath Contests: Solutions without Solving Add to Reading List Source URL: ioinformatics.org Language: English - Date: 2015-06-29 10:30:49 Mathematics competitions Education Neuropsychology American Mathematics Competitions Project Euler NP Graphing calculator Problem solving Logarithm Mathematics P versus NP problem
19	Games, geometry, and [ the computational complexity of ] finding equilibria Bernhard von Stengel Department of Mathematics London School of Economics Add to Reading List Source URL: www.maths.lse.ac.uk Language: English - Date: 2006-07-13 23:31:34 Computational complexity theory Theory of computation Complexity classes NP Matching P Time complexity Decision problem P versus NP problem 3-dimensional matching
20	Why Philosophers Should Care About Computational Complexity Scott Aaronson∗ Abstract One might think that, once we know something is computable, how efficiently it can be computed is a practical question with little fu Add to Reading List Source URL: www.scottaaronson.com Language: English - Date: 2015-06-29 18:20:41 Computational complexity theory Theory of computation Complexity classes Mathematical optimization Structural complexity theory Models of computation P versus NP problem NP Reduction Time complexity Oracle machine Low